Partition - Based Goodness -
نویسندگان
چکیده
We propose a way to construct consistent generalizations of the Cram er-von Mises test on the line, and the Watson U 2 n test on the circle, based on classes of partitions invariant under various group actions. The framework developed extends our earlier work generalizing the Kolmogorov-Smirnov and Kuiper goodness-oft tests, and provides a conceptually unifying description. Many goodness-oft tests for uniformity on the circle incorporate rotation invariance. Our construction does not require that the distribution for the null hypothesis be uniform, and permits tests invariant under general coordinate transformations. Some distribution-free tests are presented as examples, and their properties explored through numerical simulations.
منابع مشابه
Speeding Up the Search for Optimal Partitions
Numerical value range partitioning is an inherent part of inductive learning. In classification problems, a common partition ranking method is to use an attribute evaluation function to assign a goodness score to each candidate. Optimal cut point selection constitutes a potential efficiency bottleneck, which is often circumvented by using heuristic methods. This paper aims at improving the effi...
متن کاملProximal SCOPE for Distributed Sparse Learning: Better Data Partition Implies Faster Convergence Rate
Distributed sparse learning with a cluster of multiple machines has attracted much attention in machine learning, especially for largescale applications with high-dimensional data. One popular way to implement sparse learning is to use L1 regularization. In this paper, we propose a novel method, called proximal SCOPE (pSCOPE), for distributed sparse learning with L1 regularization. pSCOPE is ba...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملEXPERIMENTALl ANALYSIS OF PARTITION COEFFICIENT IN Al-Mg ALLOYS
Because the partition coefficient is one of the most important parameters affecting microsegregation, the aim of this research is to experimentally analyse the partition coefficient in Al-Mg alloys. In order to experimentally measure the partition coefficient, a series of quenching experiments during solidification were carried out. For this purpose binary Al-Mg alloys containing 6.7 and 10.2 w...
متن کاملAn Updated Review of Goodness of Fit Tests Based on Entropy
Different approaches to goodness of fit (GOF) testing are proposed. This survey intends to present the developments on Goodness of Fit based on entropy during the last 50 years, from the very first origins until the most recent advances for different data and models. Goodness of fit tests based on Shannon entropy was started by Vasicek in 1976 and were continued by many authors. In this paper, ...
متن کامل